Analysing Definitional Trees: Looking for Determinism
نویسندگان
چکیده
• Needed Narrowing (NN) is the standard operational mechanism of functional logic languages. • The definition of NN makes use of the notion of a definitional tree. • A Definitional tree is a structure which contains all the information about the program rules defining a function and guides the computation. • A great effort has been done to provide these languages with high level implementations of NN into Prolog: • A great effort has been done to provide these languages with high level implementations of NN into Prolog:
منابع مشابه
Analysing Definitional Trees: Looking for Determinism1
This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined representation of definitional trees that handles properly the knowledge about the inductive positions of a pattern. The aim is to take advantage of the new representation of definitional trees to improve the aforementioned kind of ...
متن کاملAn Implementation of Bubbling
Non-determinism is of great importance in functional logic programming. It provides expressiveness and efficiency to functional logic computations. In this paper we describe an implementation of the multiparadigm functional logic language Curry. The evaluation strategy employed by the implementation is based on definitional trees and needed narrowing for deterministic operations, while non-dete...
متن کاملModel Theory for Process Algebra
We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determinism, can be added to this theory through first-order definitional extensions. Model theory is used to analyse the discrepancies between identity in the models of the first-order extension of ACP and bisimilarity of the ...
متن کاملDefinitional Question-Answering Using Trainable Text Classifiers
Automatic question answering (QA) has gained increasing interest in the last few years. Question-Answering systems return an answer rather than a document. Definitional questions are questions such as Who is Alexander Hamilton? or what are fractals? Looking at logs of web search engines definitional questions occur quite frequently, suggesting it is an important type of questions. Analysis of p...
متن کاملThe logical basis of phylogenetic taxonomy.
Phylogenetic taxonomy, like modern Linnean taxonomy, was modeled on a phylogenetic tree rather than a cladogram and, like its predecessor, perpetuates the use of morphology as a means of recognizing clades. Both practices have generated confusion in graphical representation, operational terminology, and definitional rationale in phylogenetic taxonomy, the history of which is traced. The followi...
متن کامل